Path Relinking and Cycle-Based Neighbourhoods for Fixed Charge, Capacitated, Multicommodity Network Design
نویسندگان
چکیده
The fixed-charge capacitated multicommodity network design formulation (CMND) represents a generic model for a wide range of applications in planning the construction, development, improvement, and operation of transportation, logistics, telecommunication, and production systems (Balakrishnan, Magnanti, and Mirchandani 1997 and references therein). In these applications, multiple commodities (goods, data, people, etc.) must be routed between different points of origin and destination over a network of limited capacities. Moreover, other than the routing cost proportional to the number of units of each commodity transported over a network link, a fixed cost must be paid the first time the link is used, representing its construction (opening) or improvement costs. The objective of CMND is to identify the optimal design that is, to select the links to include in the final version of the network in order to minimize the total system cost, computed as the sum of the fixed and routing costs, while satisfying the demand for transportation.
منابع مشابه
Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design
In this paper, we propose a path relinking procedure for the fixed-charge capacitated multicommodity network design problem. Cycle-based neighbourhoods are used both to move along path between elite solutions and to generate the elite candidate set by a tabu-like local search procedure. Several variants of the method are implemented and compared. Extensive computational experiments indicate tha...
متن کاملCycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
We propose new cycle-based neighbourhood structures for meta-heuristics aimed at the fixedcharge capacitated multicommodity network design formulation. The neighbourhood defines moves that take explicitly into account the impact on the total design cost of potential modifications to the flow distribution of several commodities simultaneously. Moves are identified through a shortest path-like ne...
متن کاملLearning Mechanisms and Local Search Heuristics for the Fixed Charge Capacitated Multicommodity Network Design
In this paper, we propose a method based on learning mechanisms to address the fixed charge capacitated multicommodity network design problem. Learning mechanisms are applied on each solution to extract meaningful fragments to build a pattern solution. Cycle-based neighborhoods are used both to generate solutions and to move along a path leading to the pattern solution by a tabu-like local sear...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA Three-Stage Matheuristic for the Capacitated Multi-Commodity Fixed- Cost Network Design with Design- Balance Constraints
This paper proposes a three-stage matheuristic solution strategy for the capacitated multi-commodity fixed-cost network design problem with design-balance constraints. The proposed matheuristic combines exact and neighbourhood-based methods. The proposed tabu-search and path-relinking meta-heuristics cooperate to generate as many feasible solutions as possible. The two meta-heuristics incorpora...
متن کامل